On directed analogues of expander and hyperfinite graph sequences

نویسندگان

چکیده

We introduce and study analogues of expander hyperfinite graph sequences in the context directed acyclic graphs, which we call "extender" "hypershallow" sequences, respectively. Our main result is a probabilistic construction non-hypershallow sequences.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the effects of cooperative versus individual directed reading thinking activities on students inferential and referential questions

two groups of students were assigned as experimental and control ones, and were given instruction on directed reading-thinking activities and after some treatment, they were post-tested. although the initial pre-test did not show any significant differences, the final post-test result revealed that the cooperative reading comprehension helped the experimental group. the cooperative students’...

15 صفحه اول

On uniform sampling simple directed graph realizations of degree sequences

Choosing a uniformly sampled simple directed graph realization of a degree sequence has many applications, in particular in social networks where self-loops are commonly not allowed. It has been shown in the past that one can perform a Markov chain arc-switching algorithm to sample a simple directed graph uniformly by performing two types of switches: a 2-switch and a directed 3-cycle reorienta...

متن کامل

Directed prime graph of non-commutative ring

Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$.  Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...

متن کامل

Splitting an Expander Graph

Let G V E be an r regular expander graph Certain algorithms for nding edge disjoint paths require the edges of G to be partitioned into E E E Ek so that the graphs Gi V Ei are each expanders In this paper we give a non constructive proof of a very good split plus an algorithm which improves on that given in Broder Frieze and Upfal Existence and construction of edge disjoint paths on expander gr...

متن کامل

effect of seed priming and irrigation regimes on yield,yield components and quality of safflowers cultivars

این مطالعه در سال 1386-87 در آزمایشگاه و مزرعه پژوهشی دانشگاه صنعتی اصفهان به منظور تعیین مناسب ترین تیمار بذری و ارزیابی اثر پرایمینگ بر روی سه رقم گلرنگ تحت سه رژیم آبیاری انجام گرفت. برخی از مطالعات اثرات سودمند پرایمینگ بذر را بر روی گیاهان مختلف بررسی کرده اند اما در حال حاضر اطلاعات کمی در مورد خصوصیات مربوط به جوانه زنی، مراحل نموی، عملکرد و خصوصیات کمی و کیفی بذور تیمار شده ژنوتیپ های م...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability & Computing

سال: 2021

ISSN: ['0963-5483', '1469-2163']

DOI: https://doi.org/10.1017/s0963548321000225